A Pseudo-Greedy Heuristic for the Rectilinear Steiner Problem
نویسنده
چکیده
A new heuristic solution procedure for the solution of the rectilinear Steiner problem is proposed. The procedure is based on an innovative neighborhood structure that is explored using a pseudo-greedy approach. The probabilistic rules designed to induce search diversification are based on move attributes derived from the neighborhood structure. A Taguchi design of experiments is used to find the best settings for the search parameters associated with the proposed procedure. Extensive computational experiments show that the proposed procedure is superior to existing solution methods in terms of solution quality.
منابع مشابه
Three Evolutionary Codings of Rectilinear Steiner Arborescences
A rectilinear Steiner arborescence connects points in the Euclidean plane’s first quadrant and the origin with directed rectilinear edges from the origin up and to the right. The search for arborescences of minimum total length is NP-hard and finds applications in VLSI design. A greedy heuristic for this problem often returns near-optimum arborescences. Three genetic algorithms encode candidate...
متن کاملA Hybrid Evolutionary Algorithm for the Rectilinear Steiner Problem
One form of hybrid evolutionary algorithm encodes solutions to its target problem as permutations of the problem's elements. A greedy heuristic assembles the solution a permutation represents by appending the problem's elements to the solution in the order the permutation speci es. The algorithm searches the problem's solution space by searching the space of permutations. A hybrid genetic algor...
متن کامل1.757 and 1.267 - Approximation Algorithms for the Network and Rectilinear Steiner Tree Problems
The Steiner tree problem requires to nd a shortest tree connecting a given set of terminal points in a metric space. We suggest a better and fast heuristic for the Steiner problem in graphs and in rectilinear plane. This heuristic nds a Steiner tree at most 1.757 and 1.267 times longer than the optimal solution in graphs and rectilinear plane, respectively.
متن کاملApproaching the 5/4-Approximation for Rectilinear Steiner Trees
The rectilinear Steiner tree problem requires a shortest tree spanning a given vertex subset in the plane with rectilinear distance. It was proved that the output length of Zelikovsky's 25] and Berman/Ramaiyer 3] heuristics is at most 1.375 and 97 72 1:347 of the optimal length, respectively. It was claimed that these bounds are not tight. Here we improve these bounds to 1.3125 and 61 48 1:271,...
متن کاملA full-scale solution to the rectilinear obstacle-avoiding Steiner problem
Routing is one of the important steps in very/ultra large-scale integration (VLSI/ULSI) physical design. Rectilinear Steiner minimal tree (RSMT) construction is an essential part of routing. Macro cells, IP blocks, and pre-routed nets are often regarded as obstacles in the routing phase. Obstacle-avoiding RSMT (OARSMT) algorithms are useful for practical routing applications. However, OARSMT al...
متن کامل